Refine your search
Collections
Co-Authors
- V. N. Kamalesh
- M. Rajendiran
- S. Mathivilasini
- V. Kannan
- V. Vijayakumar
- P. E. Sankaranarayanan
- S. Nagasundaram
- N. Rakesh
- T. R. Mahesh
- G. Parthiban
- S. Uma Maheswari
- Tejy Johnson
- K. R. Anantha Padmanaban
- P. Tamilselvi
- B. Senthil Kumar
- S. Vishnu Priyan
- R. Vallikannu
- A. George
- C. Ambikavathi
- G. Meera Gandhi
- Kumaravel Appavoo
Journals
- Indian Journal of Science and Technology
- Wireless Communication
- Programmable Device Circuits and Systems
- Networking and Communication Engineering
- Digital Signal Processing
- Data Mining and Knowledge Engineering
- Artificial Intelligent Systems and Machine Learning
- International Journal of Advanced Networking and Applications
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Srivatsa, S. K.
- Node numbering in a topological structure of interconnection network
Abstract Views :736 |
PDF Views:100
Authors
Affiliations
1 Dept. of Computer Science & Engg., Sathyabama University, IN
2 St. Joseph College of Engineering, Chennai, IN
1 Dept. of Computer Science & Engg., Sathyabama University, IN
2 St. Joseph College of Engineering, Chennai, IN
Source
Indian Journal of Science and Technology, Vol 2, No 11 (2009), Pagination: 37-40Abstract
The topological design of a computer communication network assigns the links and link capacities for connecting network nodes within several constraints, with a goal to achieve a specified performance at a minimal cost. A reasonable approach is to generate a potential network topology. This paper presents a spanning tree based method for systematic numbering of nodes in any communication network. When the nodes are numbered in a systematic manner the potential network topology generated will have lesser amount of perturbation before an acceptable network is found.Keywords
Topological Design, Computer, Link Deficit Algorithm, Wireless Network, Minimum Spanning TreeFull Text
References
- Aho AV, Hopcroft JE and Ullman JD (1974) Design and analysis of computer algorithms. Addison – Wesley, Massachusett.
- Andrew S. Tanenbaum (1987) Computer networks, Prentice Hall, Englewood Cliffs
- Douglas B. West (2001) Introduction to graph theory. Pearson Education Inc., 2nd Ed
- Gerla M, Frank H and Eckl J (1974) A cut saturation algorithm for topological design of packet switched communication networks, Proc. NTC., pp. 1074-1085.
- Henzinger M, Rao S and Gabow H (2000) Computing vertex connectivity, new bounds from old techniques. J. Algorithms. 34 (2), 222-250.
- Junming Xu (2002) Topological structure and analysis of interconnection networks. Kluwer Academic Publ.
- Kamalesh VN and Srivatsa SK (2007) Numbering of nodes in computer communication networks: A brief review. Natl. Conf. on Adv. Network Technol. & Security Issues, FISAT, Cochin, Kerala, India, 8th to 10th August. pp: 278-282.
- Kamalesh VN and Srivatsa SK (2007) On topological design of computer communication network: A graph theoretical approach. GESTS: Techniques, December.
- Kamalesh VN and Srivatsa SK (2009a) On the design of minimum cost survivable network topologies. 15th Natl. Conf. on Commun., IIT Guwahati, India, 16- 18th Jan. pp: 394-397.
- Kamalesh VN and Srivatsa SK (2009b) Topological design of minimum cost survivable computer communication networks: Bipartite graph method. The Intl. J. Compu. Sci. Info. Security. 3 (July), 375-378.
- Latha S and Srivatsa SK (2007) Topological design of a k- connected network. WSEAS Transact. on Commun. 6 (4), 657-662.
- Lavia A and Manning EG (1975) Pertubation techniques for topological optimization of computer networks. Proc. Fourth Data Commun. Symp. pp: 4.16-4.23.
- Srivatsa SK and Seshaiah P (1995) On yopological design of a computer networks. Compu. Networks & ISDN Sys. 27, 567-569.
- Steiglitz K, Weiner P and Kleitman DJ (1969) The design of minimum cost survivable network. IEEE Trans. Circuit Theory. pp:455-460.
- Route Efficient on Demand Multicast Routing Protocol with Stability Link for MANETs
Abstract Views :431 |
PDF Views:135
Authors
Affiliations
1 Department of Master of Computer Applications, Panimalar Engineering College, Chennai -600123, IN
2 Department of Computer Science and Engineering, Sathyabama University, Chennai- 600119, IN
1 Department of Master of Computer Applications, Panimalar Engineering College, Chennai -600123, IN
2 Department of Computer Science and Engineering, Sathyabama University, Chennai- 600119, IN
Source
Indian Journal of Science and Technology, Vol 5, No 6 (2012), Pagination: 2866-2871Abstract
In recent years' mobile ad hoc networks (MANETs), a group oriented services has one of the primary application classes. It supports such services that use multicast routing. Therefore it is required to design stable and an efficient routing protocol for MANETs to support better packet delivery ratio, minimum delays and decreased overheads. In this paper, a multicast routing protocol based mesh networks that finds stable multicast path from source to receivers is proposed. In this model only the nodes that fulfill the delay requirements can flood the JOIN-QUERY messages. The contributing nodes are assumed to follow M/M/1 queuing systems. The queuing systems contain maximum value for queuing and contention delay which can be evaluated as the ratio of maximum queue size over the service time in a node. This model enhances link stability with contention delay and queuing system. The stable routes are found based on selection of stable forwarding nodes that have high stability of link connectivity. The link stability is calculated by using parameters link received power, distance between neighboring nodes and link quality. The performance of the proposed model is simulated over a large number of MANET nodes with wide range of mobility with two well known mesh based multicast routing protocol. It is observed that the proposed model produces better throughput and reduced overheads.Keywords
Multicast Routing, MANET, Stable Forwarding Node, Multicast Routing, Link StabilityFull Text
References
- Ahmad DT (2005) Multicasting in ad hoc networks. University of Otawa.Fall
- Biradar R, Manvi S and Reddy M (2010) Link stability based multicast routing scheme in MANET. Computer Networks. 54, 1183–1196.
- Garcia JJ, Aceves Luna and Madruga E (1999) The core assisted mesh protocol. IEEE J. on Selected Areas in Commun. 17(8) August. http://www.isi.edu/nsnam/ns.
- Lee SJ, Su W, Hsu J, Gerla M and Bagrodia R (2000) A performance comparison study of ad hoc wireless multicast protocols In: Proc.19th annual joint conference and communications societies (INFOCOM).
- Oh SY, Park JS and Gerla M (2008) E-ODMRP: enhanced ODMRP with motion adaptive refresh. Elsevier J. Parallel & Distributed Comptuting. 68
- Oh SY, Park JS and Gerla M (2008) E-ODMRP: enhanced ODMRP with motion adaptive refresh. J. Parallel & Distributed Compt. 68, 1044–1053.
- Pathrina D and Kwon M (2007) RODMRP: resilient ondemand multicast routing protocol In: Proc. 21th adv. information networking and applications workshops (AINAW). May 2007
- Paul S (1998) Multicasting on the internet and its applications. Kluwer Academic Publ.
- Perkins CE and Bhagwat P (2001) Ad hoc networks Addision-Wesley Longman Publishing Co., Inc. 2001
- Qing Dai and Jie Wu (2005) Computation of minimal uniform transmission range in ad hoc wireless networks. Cluster Computing. 8,127–133.
- Rajashekhar Biradar, Sunilkumar Manvi and Mylara Reddy (2010) Link stability based multicast routing scheme in MANET. Compu. Networks. 54, 1183-1196.
- Rodolakis G, Laouiti A, Jacquet P and Naimi AM (2008) Multicast overlay spanning trees in ad hoc networks: capacity bounds protocol design and performance evaluation. Compu. Commun. 31, 1400–1412.
- Royer E and Perkins C (2000) Multicast ad hoc on demand distance vector(c) routing draftietfmanet-maodv- 00.
- Ruiz PM and Gomez-Skarmeta AF (2004) Reducing data-overhead of mesh-based ad hoc multicast routing protocols by Steiner tree meshes In: Proc. of the first IEEE conf. on sensor and ad hoc communications and networks(SECON).
- Lee SJ, Su W and Gerla M (1999) On-demand multicast routing protocol (ODMRP) for Ad Hoc networks. Internet- Draft, draft-ietf-manet-odmrprp-Ol.txt. Work in progress.
- Saiful Azad Md, Anwar Farhat and Arafatur Rahman Md (2009) Performance comparison of proactive and reactive multicast routing protocols over wireless mesh networks. Int. J. Comp. Sci. Network Security(IJCSNS).2009; 9(6) June.
- So B, Jeon H and Lee J (2004) PEODMRP: Performance enhanced on demand multicast routing protocol In: Proc. 8th joint Conf. on Commun. & Information (JCCI).
- Tijms HC (2003) A first course in stochastic models. Chichester. Wiley,2003.
- Vasiliou A Economides AA (2005) Evaluation of multicasting algorithms in mantes In: Proc. 3rd world
- Enformatika Conference (WEC), April. 20. Wu YF, Xu YL, Chen CL and Wang K (2004) On the construction of virtual multicast backbone for wireless ad hoc networks. IEEE Int. Conf. on mobile Ad hoc and sensor systems. 294–303.
- Vaishampayan R and Garcia-Luna-Aceves JJ (2004) Protocol for unified multicasting through announcements In: Proc. of the 1st IEEE nternational conference Mobile ad-hoc and sensor systems (MASS).
- Viswanath K, Obraczka K and Tsudik G (2006) Exploring mesh and tree based multicast routing protocols for MANETs. IEEE Mobile Computing;5(1).
- Yi Y, Lee S, Su W and Gerla M. On-demand multicast routing protocol (ODMRP) for ad-hoc networks.draft-yimanet- odmrp-00.txt;2003.
- Cryptographic Security Issues in Wireless Sensor Networks
Abstract Views :135 |
PDF Views:4
Authors
Affiliations
1 Dr. M.G.R. Educational and Research Institute, Maduravoyal, Chennai - 95, Tamil Nadu, IN
2 Prathyusha Institute of Technology and Management, Poonamallee, Chennai, IN
1 Dr. M.G.R. Educational and Research Institute, Maduravoyal, Chennai - 95, Tamil Nadu, IN
2 Prathyusha Institute of Technology and Management, Poonamallee, Chennai, IN
Source
Wireless Communication, Vol 7, No 6 (2015), Pagination: 195-197Abstract
Compatibility of different cryptographic algorithms plays an important role in wireless sensor network and its applications. The various Methodology for cryptographic ratio of Memory Encryption scheme used effectively in order to save the consumption of power using each and every cryptographic Methods and that are characterized in an orderly manner. Wireless sensor networks (WSNs) consist of base station and a lot of battery-powered and low-cost devices, called sensor nodes. To provide security of the Wireless sensor networks various methods are investigated. In this paper we examine various usage of WSNs by securing the individual nodes
Keywords
WSN, Cryptographic Methods.
- Enhanced Optical Effect on the Characteristics of MODFET under Back Side Illumination
Abstract Views :137 |
PDF Views:3
Authors
Affiliations
1 Sathyabama University, Chennai-600118, Tamilnadu, IN
2 St.Josephs Engineering College, Chennai-600118, Tamilnadu, IN
1 Sathyabama University, Chennai-600118, Tamilnadu, IN
2 St.Josephs Engineering College, Chennai-600118, Tamilnadu, IN
Source
Programmable Device Circuits and Systems, Vol 3, No 7 (2011), Pagination: 348-353Abstract
The DC performance of depletion mode AlGaAs/GaAs MODFET under backside optical illumination is studied. A device structure with fiber inserted into the substrate upto the GaAs layer is considered for direct illumination into the GaAs layer. The AlGaAs layer is considered transparent to illumination. The photoconductive effect and the internal reflection effect which increase the 2DEG channel electron concentration are considered. These free electrons generated in the GaAs layer due to both photoconductive effect and the internal reflection effect are collected in 2DEG, there by increasing the source to drain current. The photo generated holes in GaAs layer drift towards the semi-insulating substrate and are capacitively coupled into the grounded source. The sheet concentration , I-V characteristics, transconductance and transfer characteristics of the device AlGaAs/GaAs MODFET have been evaluated and discussed. The I-V characteristics is compared with available experimental data at a particular gate source voltage with and without illumination.
Keywords
Optical Illumination, MODFET, Sheet Concentration, Transconductance, 2DEG.- Guidelines for Security in Cloud Computing
Abstract Views :185 |
PDF Views:3
Authors
Affiliations
1 PITAM, Chennai – 602 025, IN
2 Sakthi Mariamman Engineering College, Thandalam, Chennai–602 105, IN
1 PITAM, Chennai – 602 025, IN
2 Sakthi Mariamman Engineering College, Thandalam, Chennai–602 105, IN
Source
Networking and Communication Engineering, Vol 7, No 7 (2015), Pagination: 305-306Abstract
Cloud computing tends to be fast and rapid in our Internet environment especially in the field of IT which demands on large scale network computing. Cloud computing is able to provide its customer numerous services through Internet. Cloud computing is suffering from several issues are of the most significant Security, Service availability, integrity, authentication and storage. Security is shared responsibility of both client and service provider. In this I will focus on the development of cloud computing in security issues related with the privacy and dependability, which may be considered as the key factors that affects the security risks and suggestions and recommendation on particular area.
Keywords
Cloud Computing, Services, Security, Integrity and Storage.- A Comprehensive Investigation of Sip Protocol
Abstract Views :292 |
PDF Views:3
Authors
Affiliations
1 KNS Institute of Technology, Bangalore, IN
2 Adhiyamaan College of Engineering, Hosur, IN
3 St.Joseph College of Engineering, Chennai, Tamil Nadu, IN
1 KNS Institute of Technology, Bangalore, IN
2 Adhiyamaan College of Engineering, Hosur, IN
3 St.Joseph College of Engineering, Chennai, Tamil Nadu, IN
Source
Networking and Communication Engineering, Vol 3, No 9 (2011), Pagination: 593-597Abstract
It has become ubiquitous that VoIP technology has revolutionized the communication media at various spectra. This paper’s pivotal focus is on investigation of the impact of session initiation protocol and its future course of supporting applications at various communication related requirements. As we are aware that VoIP, an extensively used technology, is very popular and is used to transmit both data and voice packets over a single line at the lowest cost.[1]Likewise, VoATM provides synchronous transmission and is the fastest of all. VoFR is another technology gaining colossal importance in the frame relay networks and its combination with VoIP and ATM is being designed for mass usage. Hence, there is always a need to invent and explore these technologies so that the technology is delivered to all the users at a reasonable cost and the best possible service is provided.Thus, each technology is better than the other technology in some way or another. Along side protocols like RTP and SIP protocols are used for multimedia and session oriented applications respectively. This paper tries to give a complete investigation of SIP protocol.Keywords
H.323, Real Time Transport Protocol, RTSP, Session Initiation Protocol, VoIP, VoFR, VoATM.- Comparing Naive Bayes and Decision Tree Techniques for Predicting the Risk of Diabetic Retinopathy
Abstract Views :168 |
PDF Views:2
Authors
Affiliations
1 Dr. MGR Educational Research and Institute, MGR University, Chennai, IN
2 Dept. of E & I, Prathyusha Institute of Technology and Management, Chennai, IN
1 Dr. MGR Educational Research and Institute, MGR University, Chennai, IN
2 Dept. of E & I, Prathyusha Institute of Technology and Management, Chennai, IN
Source
Digital Signal Processing, Vol 7, No 5 (2015), Pagination: 141-145Abstract
Classifying data is a common task in Machine learning. Data mining in health care is an emerging field of high importance for providing prognosis and a deeper understanding of medical data. Most data mining methods depend on a set of features that define the behaviour of the learning algorithm and directly or indirectly influence the complexity of resulting models. Diabetic retinopathy the most common diabetic eye disease, is caused by complications that occurs when blood vessels in the retina weakens or distracted. We have applied machine learning methods to predict the early detection of eye disease diabetic retinopathy and found that Decision Tree method to be 90% accurate. The performance was also measured by sensitivity and specificity.Keywords
Data Mining, Naive Bayes Method, Decision Tree, Diabetes, Diabetic Retinopathy.- An Effective System for Web Page Recommendation Using Pattern Mining Algorithms
Abstract Views :167 |
PDF Views:2
Authors
Affiliations
1 Department of Information Technology, SCSVMV University, Enathur, Kancheepuram, Tamilnadu, IN
2 Department of ECE, Prathyusha Institute of Technology and Management, Chennai, Tamilnadu, IN
1 Department of Information Technology, SCSVMV University, Enathur, Kancheepuram, Tamilnadu, IN
2 Department of ECE, Prathyusha Institute of Technology and Management, Chennai, Tamilnadu, IN
Source
Data Mining and Knowledge Engineering, Vol 7, No 10 (2015), Pagination: 338-347Abstract
Web usage mining is the application of data mining techniques to discover usage patterns from web data, in order to understand and better serve the needs of web-based applications. Web usage mining is parsed into three distinctive phases such as preprocessing, pattern discovery and pattern analysis. Analyzing data through web usage mining can help effective web site management, creating adaptive Web sites, business and support services, personalization, network traffic flow analysis and etc.The aim of this paper is to give web page recommendations with help of preprocessed, analyzed web log data and user profile. In this paper combined effort of clustering and association rule mining is applied for pattern discovery which helps in finding effective usage patterns. This recommendation system provides recommendations based on user's navigational patterns and gives suitable recommendations to cater to current needs of users. The experimental results performed on real usage data show a significant improvement in the recommendation effectiveness of the proposed system.Keywords
Web Usage Mining, Web Log, Clustering, Association Rule Mining.- Performance Analysis of Various Query Optimizer Models in Query Optimization
Abstract Views :160 |
PDF Views:2
Authors
Affiliations
1 Department of Computer Science, Ethiraj College for Women, Chennai-8, IN
2 Department of CSE, Prathyusha Institute of Technology and Management (PITAM), Tiruvallur, Chennai-602025, IN
1 Department of Computer Science, Ethiraj College for Women, Chennai-8, IN
2 Department of CSE, Prathyusha Institute of Technology and Management (PITAM), Tiruvallur, Chennai-602025, IN
Source
Data Mining and Knowledge Engineering, Vol 7, No 6 (2015), Pagination: 214-219Abstract
Query Optimization has emerged as the most significant factor in today's database systems to achieve significant performance gains. It plays a vital role in tuning overall performance of the database system. The primary challenge of any database systems is to maintain the information in such a way that it can be accessed efficiently. To determine the efficient way to execute query can be done by Query Optimizer. In this paper we briefly introduce the concept of query optimization and the role of query optimizer in query optimization. This study would help the developer and database administrator to understand about the query optimizer and the technique it uses to select an access path and prepare a Query Execution plan. Modern database applications demand Query Optimizers that are extensible and efficient. Although many research works have been carried out in this field but still there are some shortcomings in each optimizer model developed. In this paper we have discussed about the shortcomings of various optimizer models and we have also proposed a new optimizer model which can meet the growing need of today's database applications.Keywords
Query Optimization, Query Optimizer, Query Execution Plan and Optimizer Model.- Prediction of User Navigation Patterns Using Knowledge from Web Log Data
Abstract Views :176 |
PDF Views:2
Authors
Affiliations
1 SCSVMV University, Kanchipuram, IN
2 Prathyusha Institute of Tech & Mgnt, Chennai, IN
1 SCSVMV University, Kanchipuram, IN
2 Prathyusha Institute of Tech & Mgnt, Chennai, IN
Source
Data Mining and Knowledge Engineering, Vol 7, No 6 (2015), Pagination: 223-226Abstract
The web access log is the best repositories for the information source. It maintains the entire record of even a tiny low event. The web log updates each time a user starts a new session. Initially the log file contains each and every detail regarding the user, the Ip address, website name, time stamp and other details. The web usage pattern analysis is a method of distinguishing browsing patterns by analyzing the user's navigation and behaviour. The internet server log files that store the knowledge concerning the guests of internet sites is employed as input for the web usage pattern analysis method. It must to trace the visitors' on-line behaviors for website usage analysis. This paper reviews the method of Preprocessing that is helpful to take clear web log data from the online server log file. The preprocessed and analyzed results are used in many areas such as net traffic analysis, economical web site administration, website modifications, system improvement and personalization and business intelligence etc.Keywords
Web Usage Mining, Web Log Data, Navigation Pattern, Prediction.- Ontology Based Decision Making-Development of Tourism Ontology in Tamilnadu
Abstract Views :175 |
PDF Views:2
Authors
Affiliations
1 SCSVMV University, Kanchipuram, IN
2 St. Joseph's College of Engineering, IN
1 SCSVMV University, Kanchipuram, IN
2 St. Joseph's College of Engineering, IN
Source
Data Mining and Knowledge Engineering, Vol 3, No 13 (2011), Pagination: 832-837Abstract
Travel and tourism is commonly known as an information intensive domain where online information places a crucial role for the whole lifecycle of the journey. Tourism in India is the largest service industry with contribution of 6.23% to the national GDP and 8.78% of the total employment in India. According to the world travel and tourism council India will be a tourism hotspot by 2018 having the highest ten year growth potential. The travel and tourism competiveness report 2007 ranked tourism in India sixth in term of price competiveness and 39th in terms of security. Tamilnadu is the top state in attracting the maximum number of foreign tourist in India. The growth in the use of internet has transferred the web users to use the internet to gather travel related information. And recent development, the semantic web aims to extend the current web standards and technology so that the semantics of the web content is machine processable. Semantically annotated websites can not only be understood by the human readers but also by machines. The backbone of semantic web is formed by ontologies. Ontologies can assist organizational, browsing, parametric search, and in more general more intelligent access to an online information and service. This paper discusses on creating ontology with the tourism domain of enough knowledge so that the tourist can search for the right destination with their criteria.Keywords
Ontologies, Owl, Protege Tool, Semantic Web.- Trigram Based Word Sense Disambiguation Using Neural Network
Abstract Views :167 |
PDF Views:4
Authors
Affiliations
1 Sathyabama University, Chennai, Tamilnadu, IN
2 St. Joseph College of Engineering, Chennai, Tamilnadu, IN
1 Sathyabama University, Chennai, Tamilnadu, IN
2 St. Joseph College of Engineering, Chennai, Tamilnadu, IN
Source
Artificial Intelligent Systems and Machine Learning, Vol 3, No 8 (2011), Pagination: 494-498Abstract
This paper presents a method to solve word sense ambiguity using neural network. Most of the previous word sense disambiguation approaches were based on neural networks, having limitations due to their huge feature set size. Here, trigram method is adopted in three ways:pre-trigram (wr1r2-ambiguous word (w) and immediate two right words (r1r2)), in-trigram (l1wr1-immediate left word (l1), ambiguous word (w) and immediate right word (r1)) and post-trigram (l2l1w-immediate left two words (l2l1) and ambiguous word (w)). Three trigram features are treated as input for five different neural networks, defined with one hidden layer with hidden neurons ranging from two to twenty. The input model is extracted from Brown corpus. In this, the performances of the networks are compared using mean squared error (mse) values. Among all networks, in-trigram based pattern recognition neural network gives 78.15% of accuracy.Keywords
In-Trigram, Neural Network, Post-Trigram, Pre-Trigram and Word Sense Disambiguation.- An Efficient Spectrum Sensing Framework and Attack Detection in Cognitive Radio Networks using Hybrid ANFIS
Abstract Views :215 |
PDF Views:0
Authors
Affiliations
1 St. Peter’s University, Chennai - 600054, Tamil Nadu, IN
2 Anna University, Chennai - 600025, Tamil Nadu, IN
1 St. Peter’s University, Chennai - 600054, Tamil Nadu, IN
2 Anna University, Chennai - 600025, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 8, No 28 (2015), Pagination:Abstract
Background: Cognitive radio is being recognized as an intelligent technology due to its ability to rapidly and autonomously adapt operating parameters to changing environments and conditions. In order to reliably and swiftly detect spectrum holes in cognitive radios, spectrum sensing must be used. Accurate spectrum sensing is important in improving the efficiency of cognitive radio networks. False sensing results in either waste of spectrum or harmful interference to primary users who may remotely or physically capture the sensors and manipulate the sensing reports. Methods: A novel framework and an innovative approach have been introduced to eliminate the malicious behaviors of secondary users. It is found that spectrum sensing alone cannot prevent the malicious behavior without any information on users’ reputation. Based on the evaluation of malicious behavior resistance methods, joint spectrum sensing and malicious nodes detection approach for optimal prevention from sensing falsification is being proposed. Findings: The proposed approach minimizes Linear Minimum Mean-Square Errors (LMMSEs) when it is compared with the existing algorithms such spectrum sensing based on HSMM and FNN based spectrum sensing are plotted versus detection probability, false alarm probability. With more malicious nodes proposed schemes are more effective to restrain the false alarms. Improvement/Application: The proposed spectrum sensesframework with attack detection which is very effective to determine the malicious users in spectrum holes.Keywords
Fuzzy Neural Network, Linear Minimum Mean Square Error, Primary User, Secondary User, Spectrum SensingFull Text
- Detection of Duplicate Region and Hybrid Non-Local Means Filtering for Denoising with Quantization Matrix Estimation for JPEG Error Analysis
Abstract Views :133 |
PDF Views:0
Authors
Affiliations
1 St. Peter’s University, Chennai - 600054, Tamil Nadu, IN
2 Anna University, Chennai - 600025, Tamil Nadu, IN
1 St. Peter’s University, Chennai - 600054, Tamil Nadu, IN
2 Anna University, Chennai - 600025, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 8, No 28 (2015), Pagination:Abstract
Background: The existing JPEG error analysis schemes do not offer agreeable results particularly when the duplicated area is small. Region duplication is an uncomplicated and efficient process to produce digital image forgeries, where a constant segment of pixels in an image, following feasible geometrical and illumination transformations are copied and pasted to a different location in the same image. Methods: In this research work, JPEG error analysis scheme is introduced for the purpose of consistent recognition of duplicated and distorted areas in a JPEG digital image forensics. Here, presented a new Multi-directional Curvelet Transform with Fourier Transform matching Invariant Rotation (MCFTIR) region duplication detection scheme to identify duplicated regions for JPEG images. This scheme begins with estimating the overlapping blocks of a JPEG image and it is organized in accordance with the statistics of multiple curvelet sub-bands. During the second phase, the amount of candidate block pairs of JPEG images has been significantly diminished by means of spatial distance between each pair of blocks for JPEG image. For duplicate region removed images theoretically analyzing the effects of these errors on single and double JPEG compression, with five major phases like Shape-Preserving Image Resizing (SPIR) scheme for the purpose of image resizing, noises are appended to image and eliminated with the help of Hybrid Non-Local Means Filtering (HNLMF) denoising framework, Image compression through Discrete Cosine Transform – Singular Value Decomposition (DCT-SVD) was computed for single and double image compression, images were quantized by means of numerous quantization matrices, quantization matrix results are estimated with Mamdani model based Adaptive Neural Fuzzy Inference System (MANFIS) and detecting the quantization table of a JPEG image. Findings: The proposed MCFTIR methods significantly outperform existing techniques in terms of the parameters like Peak Signal to Noise Ratio (PSNR) and Mean Square Error (MSE) especially for the images of small sizes. It also show that the new MCFTIR method can consistently identify JPEG image blocks which are as tiny as 8x8 pixels and compressed through quality factors as elevated as 98. This performance is significant for the purpose of analyzing and locating small tampered regions inside a composite image.Keywords
Duplicate Region Detection, Image Denoising, Image Resizing, JPEG Image Compression, Mamdani Model Based Adaptive Neural Fuzzy Inference System (MANFIS), Multi-Directional Curvelet Transform with Fourier Transform Matching Invariant Rotation (MCFTIR)Full Text
- Dynamic and Secure Joint Routing and Charging Scheme with Mobile Power Back Ferry Nodes in Mobile Adhoc Networks
Abstract Views :186 |
PDF Views:0
Authors
Affiliations
1 Hindustan University, Chennai - 603103, Tamil Nadu, IN
2 Periyar Maniyammai University, Thanjavur - 613403, Tamil Nadu, IN
3 Prathyusha Engineering College, Tiruvallur - 602025, Tamil Nadu, IN
1 Hindustan University, Chennai - 603103, Tamil Nadu, IN
2 Periyar Maniyammai University, Thanjavur - 613403, Tamil Nadu, IN
3 Prathyusha Engineering College, Tiruvallur - 602025, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 9, No 33 (2016), Pagination:Abstract
Recent introduction of hybrid architectures in Mobile Adhoc NETworks (MANETs) made researchers to concentrate on routing techniques to prolong the network lifetime with improved performance and scalability. Major research activity has been carried out to explore and improve constrained lifespan of the network by proposing on - demand power aware routing protocols. However, these protocols try to increase the network life time but doesn’t guarantee a network remain operational forever. Charging of premature failure nodes which were frequently used as relying nodes is essential to prolong network lifespan. Therefore, to improve network connectivity and lifespan, it’s essential to charge energy drained nodes based on their expected lifetime. Hence, we propose a dynamic and secure routing cum energy recharging scheme using Mobile Power Back Ferry Nodes (MPBF) to recharge energy drained nodes. Consumption of energy from the MPBF nodes affords a most trustworthy energy supply than deriving energy from other sources. This approach retains the node energy to maximum time with improved battery life by selecting a gateway based on link weight age. Secure Source- Based Loose Synchronization (SOBAS) protocol is used for authenticated power transfer. The total number of MPBF nodes required for the optimum energy conservation is determined by the target detection mechanism assigned by the Secured Sink Trail (SST). Using this joint methodology, the network lifetime and percentage of energy consumption of mobile nodes under two different scenarios (a) Variable node velocity and network traffic with fixed node density (b) Variable node density and node velocity with fixed network traffic are analyzed. We evaluate the proposed scheme performance through NS2 simulations. The results show that the proposed scheme can retain the network lifetime for a longer duration. Its performance is compared with power aware and ACO based Dynamic Power Control and load balanced energy efficient routing protocols under different QoS scenarios.Keywords
Joint routing, Energy Conservation, Mobile Power Back (MPB), Residual Energy, Secure Sink Trial, SOBAS, QoS Analysis.Full Text
- Integrated Intrusion Detection Approach for Cloud Computing
Abstract Views :174 |
PDF Views:0
Authors
Affiliations
1 Sathyabama University, Chennai, Tamil Nadu, IN
2 Prathyusha Institute of Technology and Management, Chennai, Tamil Nadu, IN
1 Sathyabama University, Chennai, Tamil Nadu, IN
2 Prathyusha Institute of Technology and Management, Chennai, Tamil Nadu, IN
Source
Indian Journal of Science and Technology, Vol 9, No 22 (2016), Pagination:Abstract
Objectives: Intrusion Detection System (IDS) models and methods are integrated for better detection of intruders and mitigation of false alarms. Integrated IDS is proposed to provide security in a cloud environment. Methods: The distributed and dynamic nature of cloud environment leads to critical issues like huge log analysis, heterogeneous traffic aggregation and scalability, etc. Intrusion specific data classification and false alarms degrades performance. This integrated model integrates both IDS models and IDS methodologies. Host-based IDS (H-IDS) model integrates with network-based IDS (N-IDS) model, as well as signature and anomaly based IDS methods are integrated to get the best of each. Findings: Whenever a Virtual Machine (VM) is created, H-IDS is in-built into its operating system to monitor the activities within that VM. N-IDS is deployed at strategic locations within the cloud network to monitor the traffic between the virtual machines and from the outside environment. Any malicious activity initiated by a cloud user using their virtual machine is detected by H-IDS. The packets flowing through the cloud network are captured and analyzed by N-IDS to detect infected packets send by hackers. The weakness of one methodology is compromised by the other during integration, but if the methods are used separately they are ineffective. Known attacks can be detected by signature based IDS and the new/unknown attack patterns are identified by anomaly based IDS. The major drawback of anomaly based IDS is high false alarm rate. It can be overcome by signature based IDS. This proposed work is implemented using Opennebula, for constructing a cloud environment and tested with IDS tools. Improvements: This integration leads to improve cloud security and trust among consumers. IDS specific issues are also rectified such as false alarms, heterogeneity etc.Keywords
Anomaly Based Detection, Cloud Computing, Intrusion Detection System, Signature Based Detection, Virtualization.Full Text
- Effective Network Intrusion Detection Using Classifiers Decision Trees and Decision Rules
Abstract Views :127 |
PDF Views:0
Authors
Affiliations
1 Department of Computer Science and Engineering, Sathyabama University, Chennai, IN
2 Higher Colleges of Technology, AE
3 St. Joseph College of Engineering, Chennai, IN
1 Department of Computer Science and Engineering, Sathyabama University, Chennai, IN
2 Higher Colleges of Technology, AE
3 St. Joseph College of Engineering, Chennai, IN
Source
International Journal of Advanced Networking and Applications, Vol 2, No 3 (2010), Pagination: 686-692Abstract
In the era of information society, computer networks and their related applications are the emerging technologies. Network Intrusion Detection aims at distinguishing the behavior of the network. As the network attacks have increased in huge numbers over the past few years, Intrusion Detection System (IDS) is increasingly becoming a critical component to secure the network. Owing to large volumes of security audit data in a network in addition to intricate and vibrant properties of intrusion behaviors, optimizing performance of IDS becomes an important open problem which receives more and more attention from the research community. In this work, the field of machine learning attempts to characterize how such changes can occur by designing, implementing, running, and analyzing algorithms that can be run on computers. The discipline draws on ideas, with the goal of understanding the computational character of learning. Learning always occurs in the context of some performance task, and that a learning method should always be coupled with a performance element that uses the knowledge acquired during learning. In this research, machine learning is being investigated as a technique for making the selection, using as training data and their outcome. In this paper, we evaluate the performance of a set of classifier algorithms of rules (JRIP, Decision Tabel, PART, and OneR) and trees (J48, RandomForest, REPTree, NBTree). Based on the evaluation results, best algorithms for each attack category is chosen and two classifier algorithm selection models are proposed. The empirical simulation result shows the comparison between the noticeable performance improvements. The classification models were trained using the data collected from Knowledge Discovery Databases (KDD) for Intrusion Detection. The trained models were then used for predicting the risk of the attacks in a web server environment or by any network administrator or any Security Experts. The Prediction Accuracy of the Classifiers was evaluated using 10-fold Cross Validation and the results have been compared to obtain the accuracy.Keywords
Classifier, Data Mining, Decision Trees, Decision Rules, Intrusion Detection, KDD Dataset, Machine Learning, Network Security.Full Text